Truth, Justice, and Cake Cutting

Cake Cutting: Envy and Truth

We study envy-free cake cutting with strategic agents, where each agent may manipulate his private information in order to receive a better allocation. We focus on piecewise constant utility functions and consider two scenarios: the general setting without any restriction on the allocations and the restricted setting where each agent has to receive a connected piece. We show that no determinist...

مبانی منطقی طراحی سیستم خط‌مشی‌گذاری دولتی برای تحقق عدالت حق‌مدار (براساس نهج‌البلاغه)

This article demonstrates a part of findings of a research that has been designed with the intention of determining the characteristics of the desired public policy making system for achieving social justice. To begin with, James P. Sterba's categorization of alternative political perspectives to justice is reviewed and then "truth – oriented" justice is studied. To reach a precise and scholar...

Cake-Cutting is Not a Pie e of Cake

Meta-envy-free Cake-cutting and Pie-cutting Protocols

This paper discusses cake-cutting protocols when the cake is a heterogeneous good, represented by an interval on the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Meta-envy-free means there is no envy on role assignments, that is, no party wants to exchange his/her role in the protocol with the one of any o...

H R  C C *

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...